/*
 * Copyright (C) 2011 JiangHongTiao <jjurco.sk_gmail.com>
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
package sk.lieskove301.jianghongtiao.liaad.prisoner.ga.selection;

import java.util.List;
import sk.lieskove301.jianghongtiao.liaad.prisoner.agent.Agent;

/**
 * Date of create: May 24, 2011
 *
 * @author JiangHongTiao <jjurco.sk_gmail.com>
 * @version 2011.0524
 */
public interface Selection {
    
    /**
     * select best agents based on some strategy. Number of selected agents have 
     * to be greater than 2 and it cannot be whole population like before. 
     * @param population population of agents. Algorithm will select new agents 
     * from this population
     * @param number number of agents to select
     * @return list of agents selected from population. We will use these agents 
     * to make new population
     */
    public List<Agent> selectAgents(List<Agent> population);
    
    /**
     * set approximate percent number of selected agents
     * @param percet number of percent to select
     */
    public void setAproxSelectionSize(double percet);
    
}
